Gray Code Enumeration of Plane Straight-Line Graphs
نویسندگان
چکیده
We develop Gray code enumeration schemes for geometric straight-line graphs in the plane. The considered graph classes include plane graphs, connected plane graphs, and plane spanning trees. Previous results were restricted to the case where the underlying vertex set is in convex position.
منابع مشابه
On Universal Point Sets for Planar Graphs
A set P of points in R is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n 15. Conversely, we use a computer program to show that there exist universal point sets for all n 10 and to enumerate all corresponding order types. Finally, we describe a col...
متن کاملVertex-Colored Encompassing Graphs
It is shown that every disconnected vertex-colored plane straight line graph with no isolated vertices can be augmented (by adding edges) into a connected plane straight line graph such that the new edges respect the coloring and the degree of every vertex increases by at most two. The upper bound for the increase of vertex degrees is best possible: there are input graphs that require the addit...
متن کاملCompatible Matchings for Bichromatic Plane Straight-line Graphs
Two plane graphs with the same vertex set are compatible if their union is again a plane graph. We consider bichromatic plane straight-line graphs with vertex set S consisting of the same number of red and blue points, and (perfect) matchings which are compatible to them. For several different classes C of graphs, we present lower and upper bounds such that any given graph G(S) ∈ C admits a com...
متن کاملFáry's Theorem for 1-Planar Graphs
Fáry’s theorem states that every plane graph can be drawn as a straightline drawing. A plane graph is a graph embedded in a plane without edge crossings. In this paper, we extend Fáry’s theorem to non-planar graphs. More specifically, we study the problem of drawing 1-plane graphs with straight-line edges. A 1-plane graph is a graph embedded in a plane with at most one crossing per edge. We giv...
متن کاملVerified Efficient Enumeration of Plane Graphs Modulo Isomorphism
Due to a recent revision of Hales’s proof of the Kepler Conjecture, the existing verification of the central graph enumeration procedure had to be revised because it now has to cope with more than 10 graphs. This resulted in a new and modular design. This paper primarily describes the reusable components of the new design: a while combinator for partial functions, a theory of worklist algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 23 شماره
صفحات -
تاریخ انتشار 2007